A The Complexity of the Comparator Circuit Value Problem

In 1990 Subramanian de ned the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem (Ccv). He and Mayr showed that NL⊆CC⊆P, and proved that in addition to Ccv several other problems are complete for CC, including the stable marriage problem, and nding the lexicographically rst maximal matching in a bipartite graph. Although the class has not received much attention since then, we are interested in CC because we conjecture that it is incomparable with the parallel class NC which also satis es NL⊆NC⊆P, and note that this conjecture implies that none of the CC-complete problems has an e cient polylog time parallel algorithm. We provide evidence for our conjecture by giving oracle settings in which relativized CC and relativized NC are incomparable. We give several alternative de nitions of CC, including (among others) the class of problems computed by uniform polynomial-size families of comparator circuits supplied with copies of the input and its negation, the class of problems AC0-reducible to Ccv, and the class of problems computed by uniform AC0 circuits with Ccv gates. We also give a machine model for CC, which corresponds to its characterization as logspace uniform polynomial-size families of comparator circuits. These various characterizations show that CC is a robust class. Our techniques also show that the corresponding function class FCC is closed under composition. The main technical tool we employ is universal comparator circuits. Other results include a simpler proof of NL⊆CC, a more careful analysis showing the lexicographically rst maximal matching problem and its variants are CC-complete under AC0 many-one reductions, and an explanation of the relation between the Gale Shapley algorithm and Subramanian's algorithm for stable marriage. This paper continues the previous work of Cook, Lê and Ye which focused on Cook-Nguyen style uniform proof complexity, answering several open questions raised in that paper.